An extended continuous Newton method

This paper describes a numerical realization of an extended continuous Newton method defined by Diener. It traces a connected set of locally one-dimensional trajectories which contains all critical points of a smooth functionf: ⁿ . The results show that the method is effectively applicable.The authors would like to thank L. C. W. Dixon for pointing out some errors in the original version of this paper and for several suggestions of improvements.     

A Monte Carlo method for an objective Bayesian procedure

This paper describes a method for an objective selection of the optimal prior distribution, or for adjusting its hyper-parameter, among the competing priors for a variety of Bayesian models. In order to implement this method, the integration of very high dimensional functions is required to get the normalizing constants of the posterior and even of the prior distribution. The logarithm of the high dimensional integral is reduced to the one-dimensional integration of a cerain function with respect to the scalar parameter over the range of the unit interval. Having decided the prior, the Bayes estimate or the posterior mean is used mainly here in addition to the posterior mode. All of these are based on the simulation of Gibbs distributions such as Metropolis' Monte Carlo algorithm. The improvement of the integration's accuracy is substantial in comparison with the conventional crude Monte Carlo integration. In the present method, we have essentially no practical restrictions in modeling the prior and the likelihood. Illustrative artificial data of the lattice system are given to show the practicability of the present procedure.     

锥体棱镜的加工

本文简单地叙述了锥体棱镜两种加工工艺。重点介绍直接成型法加工中对角度误差~1″的控制。并提出了角度超差零件返修时的光胶方法。     

Relationships between characteristics in periodic Poisson queues

We study single server periodic queues in the day equilibrium conditions. The following characteristics of interest are considered at time of dayt: V^p(t)-the work load, L^p(t)-the number of customers and u^p(t)-the departure rate. We give relationships between E[V^p(t)], E[L^p(t)] and u^p(t). We also prove that E[V^p(t)] < and E[L^p(t)] < provided the second moment of the service time is finite.     

Likelihood estimation of soft-core interaction potentials for Gibbsian point patterns

The likelihood method is developed for the analysis of socalled regular point patterns. Approximating the normalizing factor of Gibbs canonical distribution, we simultaneously estimate two parameters, one for the scale and the other which measures the softness (or hardness), of repulsive interactions between points. The approximations are useful up to a considerably high density. Some real data are analyzed to illustrate the utility of the parameters for characterizing the regular point pattern.     

A minimum average risk approach to shrinkage estimators of the normal mean

For the problem of estimating the normal mean based on a random sample X ₁,...,X _n when a prior value ₀ is available, a class of shrinkage estimators % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-qqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xHapdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaubeaeqaje% aWbaGaamOBaaWcbeqdbaGafqiVd0MbaKaaaaGccaqGGaGaaiikaiaa% dUgacaGGPaGaeyypa0Jaam4AaiaacIcadaqfqaqabKqaahaacaqGUb% aaleqaneaacaqGubaaaOGaaiykaiaabccadaqfqaqabKqaahaacaWG% UbaaleqaneaaceqGybGbaebaaaGccaqGGaGaey4kaSIaaeiiaiaacI% cacaaIXaGaaeiiaiabgkHiTiaabccacaWGRbGaaiikamaavababeqc% baCaaiaab6gaaSqab0qaaiaabsfaaaGccaGGPaGaaiykamaavababe% qcbaCaaiaad6gaaSqab0qaaiabeY7aTbaaaaa!5615!\[\mathop {\hat \mu }\nolimits_n {\rm{ }}(k) = k(\mathop {\rm{T}}\nolimits_{\rm{n}} ){\rm{ }}\mathop {{\rm{\bar X}}}\nolimits_n {\rm{ }} + {\rm{ }}(1{\rm{ }} - {\rm{ }}k(\mathop {\rm{T}}\nolimits_{\rm{n}} ))\mathop \mu \nolimits_n \] is considered, where % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-qqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xHapdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaubeaeqaje% aWbaGaamOBaaWcbeqcdawaaiaadsfaaaGccaqGGaGaaeypaiaabcca% caWGUbWaaWbaaSqabeaacaaIXaGaai4laiaaikdaaaGccaGGOaWaa0% aaaeaacaWGybaaamaaBaaajeaWbaGaamOBaaWcbeaakiaabccacqGH% sislcaqGGaWaaubeaeqajeaWbaGaaGimaaWcbeqdbaGaaeiVdaaaki% aacMcacaqGGaGaae4laiabeccaGiabeo8aZbaa!4C33!\[\mathop T\nolimits_n {\rm{ = }}n^{1/2} (\overline X _n {\rm{ }} - {\rm{ }}\mathop {\rm{\mu }}\nolimits_0 ){\rm{ /}} \sigma \] and k is a weight function. For certain choices of k, % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-qqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xHapdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaubeaeqaje% aWbaGaamOBaaWcbeqdbaGafqiVd0MbaKaaaaGccaqGGaGaaiikaiaa% dUgacaGGPaaaaa!3CEE!\[\mathop {\hat \mu }\nolimits_n {\rm{ }}(k)\] coincides with previously studied preliminary test and shrinkage estimators. We consider choosing k from a natural non-parametric family of weight functions so as to minimize average risk relative to a specified prior p. We study how, by varying p, the MSE efficiency (relative to \-X) properties of % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-qqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xHapdbiqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaubeaeqaje% aWbaGaamOBaaWcbeqdbaGafqiVd0MbaKaaaaGccaqGGaGaaiikaiaa% dUgacaGGPaaaaa!3CEE!\[\mathop {\hat \mu }\nolimits_n {\rm{ }}(k)\] can be controlled. In the process, a certain robustness property of the usual family of posterior mean estimators, corresponding to the conjugate normal priors, is observed.     

A threshold for the size of random caps to cover a sphere

Consider a unit sphere on which are placed N random spherical caps of area 4p(N). We prove that if % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWaa0aaaeaaca% qGSbGaaeyAaiaab2gaaaWaaeWaaeaacaWGWbWaaeWaaeaacaWGobaa% caGLOaGaayzkaaGaai4Taiaad6eacaGGVaGaaeiBaiaab+gacaqGNb% Gaaeiiaiaad6eaaiaawIcacaGLPaaacqGH8aapcaaIXaaaaa!454E!\[\overline {{\rm{lim}}} \left( {p\left( N \right)\cdotN/{\rm{log }}N} \right) < 1\], then the probability that the sphere is completely covered by N caps tends to 0 as N , and if % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGGipm0dc9vqaqpepu0xbbG8F4rqqrFfpeea0xe9Lq-Jc9% vqaqpepm0xbba9pwe9Q8fs0-yqaqpepae9pg0FirpepeKkFr0xfr-x% fr-xb9adbaqaaeGaciGaaiaabeqaamaabaabaaGcbaWaaWaaaeaaca% qGSbGaaeyAaiaab2gaaaWaaeWaaeaacaWGWbWaaeWaaeaacaWGobaa% caGLOaGaayzkaaGaai4Taiaad6eacaGGVaGaaeiBaiaab+gacaqGNb% Gaaeiiaiaad6eaaiaawIcacaGLPaaacqGH+aGpcaaIXaaaaa!4551!\[\underline {{\rm{lim}}} \left( {p\left( N \right)\cdotN/{\rm{log }}N} \right) > 1\], then for any integer n>0 the probability that each point of the sphere is covered more than n times tends to 1 as N .     

The upper and lower second order directional derivatives of a sup-type function

The purpose of this paper is to give a formula for expressing the second order directional derivatives of the sup-type functionS(x) = sup{f(x, t); t T} in terms of the first and second derivatives off(x, t), whereT is a compact set in a metric space and we assume thatf, f/x and ² f/x ² are continuous on ⁿ × T. We will give a geometrical meaning of the formula. We will moreover give a sufficient condition forS(x) to be directionally twice differentiable.     

Decomposition of multiattribute expected-utility functions

This paper integrates and extends the theory of the decomposition of multiattribute expected-utility functions based on utility independence. In a preliminary section, the standard decision model of expected utility is briefly discussed, including the fact that the decision maker's preference forlotteries with two outcomes determines the utility function uniquely. The decomposition possibilities of a utility function are captured by the concept ofautonomous sets of attributes, an affine separability of some kind known as generalized utility independence.Overlapping autonomous sets lead to biaffine-associative, i.e.multiplicative oradditive decompositions. The multiplicative representation shows that autonomy has strongerclosure properties than utility independence, for instance with respect to set-theoretic difference. Autonomy is also a concept with a wider scope since it applies to the decomposition of Boolean functions, games and a number of other topics in combinatorial optimization. This relationship to the well-known theory ofsubstitution decomposition in discrete mathematics also reveals a kind of discrete core behind the decomposition of utility functions. The entirety of autonomous sets can be represented by a compact data structure, the so-calledcomposition tree, which frequently corresponds to a natural hierarchy of attributes. Multiplicative/additive ormulti-affine functions correspond to the hierarchy steps. The known representation of multi-affine functions is shown to be given by aMoebius inversion formula. The entire approach has the advantage that it allows the application of more sophisticated representation methods on a detailed level, whereas it employs onlyfinite set theory andarithmetic on the main levels in the hierarchy.     

Solvable isotherms for a two-component system of charged rods on a line

The Coulomb system consisting of an equal number of positive and negative charged rods confined to a one-dimensional lattice is studied. The grand partition function can be calculated exactly at two values of the coupling constant=q ²/k _B T (q denoting the magnitude of the charges). The exact results lead to the conjecture that in the complex scaled fugacity plane, all the zeros of the grand partition function lie on the negative real axis for<2, on the point=–1 for=2, and on the unit circle for>2. In addition, for>4, we conjecture in general and prove at=4 that the zeros pinch the real axis in the thermodynamic limit, with an essential singularity in the pressure at the reduced density 1/2.